Handling Deceptive Problems Using a Diierent Genetic Search
نویسنده
چکیده
|In recent years, several studies have been devoted to the design of problems with diierent degrees of deception in order to investigate the performance of GAs. This paper presents a diierent genetic approach, called the Structured Genetic Algorithm (sGA) for solving GA-deceptive problems. The Structured GA uses an hierarchical encoding and a gene expression mechanism in its overspeciied chro-mosomal representation. The paper reported some experimental results which demonstrated that on using a diierent chromosomal representation (as in sGA), the genetic search becomes more robust and can easily handle so-called GA-deceptive problems.
منابع مشابه
Handling Deceptive Problems Using a Different Genetic Search
|In recent years, several studies have been devoted to the design of problems with diierent degrees of deception in order to investigate the performance of GAs. This paper presents a diierent genetic approach, called the Structured Genetic Algorithm (sGA) for solving GA-deceptive problems. The Structured GA uses an hierarchical encoding and a gene expression mechanism in its overspeciied chro-m...
متن کاملFundamental Principles of Deception in Genetic Search
This paper presents several theorems concerning the nature of deception and the central role that deception plays in function optimization using genetic algorithms. A simple proof is ooered which shows that the only problems which pose challenging optimization tasks are problems that involve some degree of deception and which result in connicting k-arm bandit competitions between hyperplanes. T...
متن کاملOptimizing Engineering Designs Using a Combined Genetic Search
In the optimization of engineering designs, traditional search and optimization methods face at least two diiculties: (i) since each is specialized in solving a particular type of problem, one method does not work well on diierent types of problems (ii) most of them are designed to work on continuous search spaces. Since diierent optimal engineering design problems give rise to objective and co...
متن کاملA Continuous Plane Model to Machine Layout Problems Considering Pick-Up and Drop-Off Points: An Evolutionary Algorithm
One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...
متن کاملFitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Ameasure of search di culty tness distance correlation FDC is introduced and exam ined in relation to genetic algorithm GA performance In many cases this correlation can be used to predict the performance of a GA on problems with known global maxima It correctly classi es easy deceptive problems as easy and di cult non deceptive problems as di cult indicates when Gray coding will prove better t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007